Arc Triangulations ∗
نویسندگان
چکیده
The quality of a triangulation is, in many practical applications, influenced by the angles of its triangles. In the straight line case, angle optimization is not possible beyond the Delaunay triangulation. We propose and study the concept of circular arc triangulations, a simple and effective alternative that offers flexibility for additionally enlarging small angles. We show that angle optimization and related questions lead to linear programming problems, and we define unique flips in arc triangles. A possible application of arc triangulations in the area of graph drawing is detailed.
منابع مشابه
Triangulations with Circular and Parabolic Arcs
In this paper, we expand circular arc triangulations with parabolic arcs, which are triangulations whose edges are circular or parabolic arcs. Creating triangulations this way bears several advantages if angles are to be optimized, especially for finite element method. A typical reason for the occurrence of small angles in a straight line triangulation is that the geometry of the vertex set for...
متن کاملSchool of IT Technical Report ELLIPSE AND ARC ROUTING ALGORITHMS FOR DELAUNAY TRIANGULATIONS
Oblivious online routing (OOR) algorithms are suitable when applications only have local information available to make routing decisions. This paper presents two new OOR algorithms for Delaunay triangulations: the Ellipse Routing algorithm and the Arc Routing algorithm. Both of their names come from the shapes of their searching areas for the next-hop neighbor. This paper also evaluates and com...
متن کاملArc Permutations ( extended abstract )
Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. In this paper we describe combinatorial properties of these permutations, including characterizations in terms of pattern avoidance, connections to Young tableaux, and an affine Weyl group action on them. Résumé. Les permutations arc et les permutations unimodales ont été introduites dans l...
متن کاملFibered Faces, Veering Triangulations, and the Arc Complex
We study the connections between subsurface projections in curve and arc complexes in fibered 3-manifolds and Agol’s veering triangulation. The main theme is that large-distance subsurfaces in fibers are associated to large simplicial regions in the veering triangulation, and this correspondence holds uniformly for all fibers in a given fibered face of the Thurston norm.
متن کاملArc Diagrams, Flip Distances, and Hamiltonian Triangulations
We show that every triangulation (maximal planar graph) on n 6 vertices can be flipped into a Hamiltonian triangulation using a sequence of less than n/2 combinatorial edge flips. The previously best upper bound uses 4-connectivity as a means to establish Hamiltonicity. But in general about 3n/5 flips are necessary to reach a 4-connected triangulation. Our result improves the upper bound on the...
متن کامل